The time to read the input and initialise the problem = 312 ms
The time to create the LP bound problem = 0 ms
The time to compute the linear programming bound = 110 ms
The linear programming lower bound on the solution is:
x11=0.000000
x12=0.000000
x13=0.000000
x14=0.531746
x15=0.468254
x21=0.000000
x22=0.000000
x23=0.000000
x24=0.000000
x25=1.000000
x31=0.000000
x32=0.000000
x33=0.000000
x34=0.531746
x35=0.468254
x41=0.000000
x42=0.000000
x43=0.000000
x44=0.531746
x45=0.468254
x51=0.000000
x52=0.000000
x53=0.000000
x54=0.000000
x55=1.000000
x61=0.000000
x62=0.000000
x63=0.000000
x64=0.000000
x65=1.000000
x71=0.000000
x72=0.000000
x73=0.000000
x74=0.531746
x75=0.468254
x81=0.000000
x82=0.000000
x83=0.000000
x84=0.301323
x85=0.698677
x91=0.000000
x92=0.000000
x93=0.000000
x94=0.531746
x95=0.468254
x101=0.000000
x102=0.000000
x103=0.000000
x104=0.531746
x105=0.468254
y1=0.000000
y2=0.000000
y3=0.000000
y4=0.531746
y5=1.000000
z1=0.091000
z2=0.000000
z3=0.000000
w11=0.000000
w12=0.000000
w13=0.000000
w14=67.000000
w15=115.000000
w21=0.000000
w22=0.000000
w23=0.000000
w24=0.000000
w25=0.000000
w31=0.000000
w32=0.000000
w33=0.000000
w34=0.000000
w35=0.000000
z=33609.666614
The time to read the LP bound solution = 0 ms
Run time is 1422 ms
